Generalized Fair Reachability Analysis for Cyclic Protocols with Nondeterminism and Internal Transitions

In this paper, we extend the generalized fair reachability notion to cyclic protocols with nondeterminism and internal transitions. By properly incorporating internal transitions into the formulation of fair progress vectors, we prove that most of the results established for cyclic protocols without nondeterminism and internal transitions still hold even if nondeterminism and internal transitions are allowed. We identify indee-niteness as a new type of logical error resulting from reachable internal execution cycles and show that indeeniteness can also be detected for the class of cyclic protocols with nite fair reachable state spaces with nite extensions.